منابع مشابه
Online multi-server dial-a-ride problems
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dram...
متن کاملA tabu search heuristic for the static multi-vehicle dial-a-ride problem
This article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable ...
متن کاملParallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
In the Dial-a-Ride Problem (DARP) users specify transportation requests between origins and destinations to be served by vehicles. In the Dynamic DARP, requests are received throughout the day and the primary objective is to accept as many requests as possible while satisfying operational constraints. This article describes and compares a number of parallel implementations of a tabu search heur...
متن کاملRevenue Maximization in Online Dial-A-Ride
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server’s goal is to maximize its total revenue within a given time limit, T . We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm...
متن کاملA stochastic model for a vehicle in a dial-a-ride system
Weconsider a stochasticmodel for a systemwhich can serve n customers concurrently, and each accepted and departing customer generates a service interruption. The proposed model describes a single vehicle in a dial-a-ride transport system and is closely related to Erlang’s loss system. We give closed-form expressions for the blocking probability, the acceptance rate, and the mean sojourn time, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2015
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2629653